Capacity bounds for the three-dimensional (0, 1) run length limited channel
نویسندگان
چکیده
The capacity of a three-dimensional (0 1) run length constrained channel is shown to satisfy 0 522501741838 0 526880847825.
منابع مشابه
Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel
The capacity C(3) 0;1 of a 3-dimensional (0; 1) run length constrained channel is shown to satisfy 0:522501741838 C(3) 0;1 0:526880847825 . The authors are with the Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla CA 92093-0407. Email: fnagy,[email protected] . The research was supported in part by the National Science Foundation.
متن کاملar X iv : m at h - ph / 0 60 30 01 v 2 8 J un 2 00 9 The 1 - vertex transfer matrix and accurate estimation of channel capacity
The notion of a 1-vertex transfer matrix for multi-dimensional codes is introduced. It is shown that the capacity of such codes, or the topological entropy, can be expressed as the limit of the logarithm of spectral radii of 1-vertex transfer matrices. Storage and computations using the 1-vertex transfer matrix are much smaller than storage and computations needed for the standard transfer matr...
متن کاملNew Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems
We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially a combinatorial counting problem, into a probabilistic setting, we are able to derive new lower and upper bounds on the capacity of (0, k)-RLL systems. These bounds are better than all previously-known bounds for k 2, and are e...
متن کاملThe 1-vertex transfer matrix and accurate estimation of channel capacity
The notion of a 1-vertex transfer matrix for multidimensional codes. It is shown that the capacity of such codes, or the topological entropy, can be expressed as the limit of the logarithm of spectral radii of 1-vertex transfer matrices. Storage and computations using the 1-vertex transfer matrix are much smaller than storage and computations needed for the standard transfer matrix. The method ...
متن کاملOn the capacity of two-dimensional run-length constrained channels
Two-dimensional binary patterns that satisfy onedimensional (d; k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd; k is defined as Cd; k = limm;n!1 log2N (d; k) m;n =mn, where N (d; k) m;n denotes the number of m n rectangular patterns that satisfy the two-dimensional (d; k) run-length constraint. Bounds on Cd; k are given and it is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2000